Natural lifts of Dorfman brackets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON THE LIFTS OF SEMI-RIEMANNIAN METRICS

In this paper, we extend Sasaki metric for tangent bundle of a Riemannian manifold and Sasaki-Mok metric for the frame bundle of a Riemannian manifold [I] to the case of a semi-Riemannian vector bundle over a semi- Riemannian manifold. In fact, if E is a semi-Riemannian vector bundle over a semi-Riemannian manifold M, then by using an arbitrary (linear) connection on E, we can make E, as a...

متن کامل

Lifts of projective congruence groups

We show that noncongruence subgroups of SL2(Z) projectively equivalent to congruence subgroups are ubiquitous. More precisely, they always exist if the congruence subgroup in question is a principal congruence subgroup Γ(N) of level N > 2, and they exist in many cases also for Γ0(N). The motivation for asking this question is related to modular forms: projectively equivalent groups have the sam...

متن کامل

Theta-lifts of Maass Waveforms

Let O be an arbitrary order in an indeenite quaternion division algebra over Q. If O 1 is the group of elements in O with norm equal to 1, and H the complex upper half-plane, then X O := O 1 nH is a compact Riemann surface. Furthermore, let ? 0 (d) SL 2 (Z) be the Hecke congruence group of level d. Then X d := ? 0 (d)nH is a non-compact Riemann surface with nite volume. Let be the hyperbolic La...

متن کامل

Tropical Constructions and Lifts

1 The Algebraic Torus and M Let K denote a field of characteristic zero and K∗ denote the associated multiplicative group. A character on (K∗)n is a monomial in the associated Laurent polynomial ring with coefficient 1. For example, (K∗)2 has coordinate ring K[x±1, y±1] and characters on (K∗)2 are of the form xy for i, j ∈ Z. (K∗)n is called the algebraic n-torus. First we must describe functio...

متن کامل

Computational complexity of polyadic lifts of generalized quantifiers in natural language

We study the computational complexity of polyadic quantifiers in natural language. This type of quantification is widely used in formal semantics to model the meaning of multi-quantifier sentences. First, we show that the standard constructions that turn simple determiners into complex quantifiers, namely Boolean operations, iteration, cumulation, and resumption, are tractable. Then, we provide...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Theoretical and Mathematical Physics

سال: 2018

ISSN: 1095-0761,1095-0753

DOI: 10.4310/atmp.2018.v22.n6.a2